Papers with binary classifiers
A Unified Sequence Labeling Model for Emotion Cause Pair Extraction (2020.coling-main)
Copied to clipboard
| Challenge: | Existing methods for emotion-cause pair extraction cannot distinguish emotion-caused pairs from each other . Existing approaches may suffer from possible cascading errors . |
| Approach: | They propose to assign emotion type labels to emotion and cause clauses so that they can be easily distinguished. |
| Outcome: | The proposed method can extract multiple emotion-cause pairs in an end-to-end fashion. |
Content-Based Conflict of Interest Detection on Wikipedia (L18-1)
Copied to clipboard
| Challenge: | Conflict-of-Interest (CoI) editing is a problem on Wikipedia that is highly subjective . a key feature of Wiki sites is to allow people from all over the world to add or modify articles anonymously and without consequence. |
| Approach: | They frame CoI detection as a binary classification problem and explore features for it . they find that stylometric features outperform other types of features and give an F-measure of 0.63 . |
| Outcome: | The proposed method outperforms other features and gives an F-measure of 0.63 . the proposed method is not certain that the set of non-CoI articles contains any CoI articles . |
Scalable Evaluation and Improvement of Document Set Expansion via Neural Positive-Unlabeled Learning (2021.eacl-main)
Copied to clipboard
| Challenge: | Current methods for document set expansion for large collections are based on word-frequency or bag-of-words document similarity metrics. |
| Approach: | They propose to extend the IR approach by treating the problem as an instance of positive-unlabeled (PU) learning . they propose solutions for each challenge and empirically validate them with ablation tests . |
| Outcome: | The proposed method improves on a PubMed abstract retrieval task . it is compared with existing methods and empirically validated with ablation tests . |
FAID: Fine-grained AI-generated Text Detection using Multi-task Auxiliary and Multi-level Contrastive Learning (2026.eacl-long)
Copied to clipboard
Minh Ngoc Ta, Dong Cao Van, Duc-Anh Hoang, Minh Le-Anh, Truong Nguyen, My Anh Tran Nguyen, Yuxia Wang, Preslav Nakov, Dinh Viet Sang
| Challenge: | Existing binary detection frameworks for human-written, LLM-generated and human-LLM collaborative texts are challenging . a recent study focused on binary detection, i.e., human vs. LLM, or on fine-grained detection limited to English. |
| Approach: | They propose a fine-grained detection framework to classify text into three categories . they use multilingual datasets and a multi-domain, multi-generator dataset . |
| Outcome: | The proposed framework outperforms baselines on unseen domains and new LLMs. |
Explainable Slot Type Attentions to Improve Joint Intent Detection and Slot Filling (2022.findings-emnlp)
Copied to clipboard
| Challenge: | Existing methods analyze and compute features collectively for all slot types, and have no way to explain slot filling model decisions. |
| Approach: | They propose a method that learns to generate additional slot type specific features to improve accuracy and provides explanations for slot filling decisions for the first time in a joint NLU model. |
| Outcome: | The proposed model improves on two widely used datasets and provides an explanation for slot filling decisions for the first time. |
EnDex: Evaluation of Dialogue Engagingness at Scale (2022.findings-emnlp)
Copied to clipboard
| Challenge: | Existing models that measure engagement use expensive human annotas and abstract definitions of the term. |
| Approach: | They propose a human-reaction based model to evaluate dialogue engagingness . they propose combining distant-supervision with a theoretical foundation for engagement . |
| Outcome: | The proposed model is trained on 80k Reddit-based engagement datasets . it uses distant-supervision from human-reaction feedback to evaluate dialogue engagementness . |
Hierarchical Transfer Learning for Multi-label Text Classification (P19-1)
Copied to clipboard
| Challenge: | Multi-Label Hierarchical Text Classification (MLHTC) is a task of categorizing documents into one or more topics organized in an hierarchical taxonomy. |
| Approach: | They propose a transfer learning based strategy where binary classifiers at lower levels are initialized using parameters of the parent classifier and fine-tuned on the child category classification task. |
| Outcome: | The proposed method improves on micro-F1 and macro-F1, respectively, compared to binary classifiers trained from scratch. |
Improving Bias Mitigation through Bias Experts in Natural Language Understanding (2023.emnlp-main)
Copied to clipboard
| Challenge: | Existing approaches to mitigate the detrimental effect of bias on the network include debiasing methods that down-weight the biased examples identified by an auxiliary model, which is trained with explicit bias labels. |
| Approach: | They propose a framework that introduces binary classifiers between the auxiliary model and main model, coined bias experts, to reduce the detrimental effect of bias on the network. |
| Outcome: | The proposed approach outperforms the state-of-the-art on various datasets while achieving high performance on in-distribution data. |
The World is Not Binary: Learning to Rank with Grayscale Data for Dialogue Response Selection (2020.emnlp-main)
Copied to clipboard
| Challenge: | Existing approaches to learning-to-rank response selection are suboptimal due to ignorance of diversity of response quality. |
| Approach: | They propose to use off-the-shelf response retrieval models as automatic grayscale data generators to train response selection models. |
| Outcome: | The proposed approach can be automated without human effort on grayscale data. |
Exploring Space Efficiency in a Tree-based Linear Model for Extreme Multi-label Classification (2024.emnlp-main)
Copied to clipboard
| Challenge: | Extreme multi-label classification (XMC) aims to identify relevant subsets from numerous labels. |
| Approach: | They propose to store a tree model under the assumption of sparse data under the condition that some features may be unused when training binary classifiers in a trees method. |
| Outcome: | The proposed method can save 10% of the size of the standard one-vs-rest method for multi-label classification. |